Mixed succession rules: The commutative case

نویسندگان

  • Silvia Bacchelli
  • Luca Ferrari
  • Renzo Pinzani
  • Renzo Sprugnoli
چکیده

We begin a systematic study of the enumerative combinatorics of mixed succession rules, which are succession rules such that, in the associated generating tree, the nodes are allowed to produce their sons at several different levels according to different production rules. Here we deal with a specific case, namely that of two different production rules whose rule operators commute. In this situation, we are able to give a general formula expressing the sequence associated with the mixed succession rules in terms of the sequences associated with the component production rules. We end by providing some examples illustrating our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis and design of sequencing rules for car sequencing

This paper presents novel approaches for generating sequencing rules for the car sequencing (CS) problem in cases of two and multiple processing times per station. The CS problem decides on the succession of different car models launched down a mixed-model assembly line. It aims to avoid work overloads at the stations of the line by applying so-called sequencing rules, which restrict the maximu...

متن کامل

Identification and prioritizing Succession Management Barriers in Shiraz Petrochemical Company by mixed method

The purpose of this study was to identify and prioritize the barriers of succession management in Shiraz Petrochemical Company. The mixed method has been. In qualitative stage, by means of thematic analysis and semi-structured interviewing, the obstacles of succession management were explored. The potential participants in this stage were 30 people including experts in the Shiraz Petrochemical ...

متن کامل

On the car sequencing problem : analysis and solution methods

This paper presents novel approaches for generating sequencing rules for the car sequencing (CS) problem in cases of two and multiple processing times per station. The CS problem decides on the succession of different car models launched down a mixed-model assembly line. It aims to avoid work overloads at the stations of the line by applying so-called sequencing rules, which restrict the maximu...

متن کامل

A Note on Rational Succession Rules

Succession rules having a rational generating function are usually called rational succession rules. In this note we discuss some problems concerning rational succession rules, and determine a simple method to pass from a rational generating function to a rational succession rule, both defining the same number sequence. 2

متن کامل

Commutative Cellular Automata

Totalistic cellular automata were introduced by Wolfram [1, 2] as a means of studying higher-color cellular automata within a reasonable space of possible rules. The underlying principle is to systematically construct a subset of rules within all the possible rules of the highercolor cellular automata, and the system in totalistic cellular automata is to add up the values of the cells within th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 117  شماره 

صفحات  -

تاریخ انتشار 2010